Parallel desynchronized block matching: A feasible scheduling algorithm for the input-buffered wavelength-routed switch
نویسندگان
چکیده
منابع مشابه
Parallel desynchronized block matching: A feasible scheduling algorithm for the input-buffered wavelength-routed switch
The Input-Buffered Wavelength-Routed (IBWR) switch is a promising switching architecture for slotted Optical Packet Switching (OPS) networks. The benefits of the IBWR fabric are a better scalability and lower hardware cost, when compared to output buffered OPS proposals. A previous work characterized the scheduling problem of this architecture as a type of matching problem in bipartite graphs. ...
متن کاملRPA: a flexible scheduling algorithm for input buffered switches
This paper presents and evaluates a quasi-optimal scheduling algorithm for input buffered cell-based switches, named reservation with preemption and acknowledgment (RPA). RPA is based on reservation rounds where the switch input ports indicate their most urgent data transfer needs, possibly overwriting less urgent requests by other input ports, and an acknowledgment round to allow input ports t...
متن کاملDesynchronized Two-Dimensional Round-Robin Scheduler for Input Buffered Switches
We propose a new arbitration algorithm, called the desynchronized two-dimensional round-robin (D2DRR), for input queued packet switches in which each input port maintains a separate logical queue for each output. D2DRR is an enhanced version of 2DRR, and thus improves fairness over 2DRR without a starvation problem. Iterative maximal matching schemes including iSLIP yield better throughput with...
متن کاملISA-Independent Scheduling Algorithm for Buffered Crossbar Switch
ISA-Independent Scheduling Algorithm for Buffered Crossbar Switch Dr. Kannan Balasubramanian Department of Computer Science, Mepco Schlenk Engineering College, Sivakasi-05. Email: [email protected] C.Sindhu Department of Computer Science, Mepco Schlenk Engineering College, Sivakasi-05. Email: [email protected] ------------------------------------------------------------------ABSTRAC...
متن کاملPMM: a pipelined maximal-sized matching scheduling approach for input-buffered switches
This paper proposes an innovative Pipeline-based Maximalsized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2007
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2007.05.004